Temporal logic for real-time systems
نویسندگان
چکیده
منابع مشابه
Temporal Logic for Real-time Systems*
points of the classical control theory which is based on the frequency domain description of the plant, so that the H-infinity control theory has been actively studied in the recent years. It is the design method in the frequency domain based on the modern control theory. However, the H-infinity theory at the present time lacks the identification of the frequency domain. The topics treated here...
متن کاملTILCO Temporal Logic for Real-Time Systems Implementation in C++
Temporal logics are capable to describe temporal constraints among events and actions, as invariance, precedence, periodicity, repeated occurrences, liveness and safety conditions. They are typically used to specify and verify properties in the requirement analysis, to describe the system behavior that can be verified via property proof. Operational approaches have a state-based semantics which...
متن کاملAn Expressive Temporal Logic for Real Time
We add to the standard temporal logic with the modalities ”Until” and ”Since”, a sequence of “counting modalities”: For each n the modality Cn(X), which says that X will be true at least at n points in the next unit of time, and its past counterpart ←− C n, which says that X has happened at least n times in the last unit of time. We prove that this temporal logic is as expressive as can be hope...
متن کاملWrapping Real-Time Systems from Temporal Logic Specifications
This paper defines a methodology for developing wrappers for real-time systems starting from temporal logic specifications. Error confinement wrappers are automatically generated from the specifications of the target real-time system. The resulting wrappers are the executable version of the specifications, and account for both timing and functional constraints. They are executed on-line by a ru...
متن کاملReal Time Temporal Logic: Past, Present, Future
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that timed languages specified by the past fragment of MITL, can be accepted by deterministic timed automata. On the other hand we provide a proof that certain languages expressed in the future fragment of MITL are not dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1991
ISSN: 0167-6423
DOI: 10.1016/0167-6423(91)90029-w